Inefficiency of voting in Parrondo games
نویسندگان
چکیده
We study a modification of the so-called Parrondo’s paradox where a large number of individuals choose the game they want to play by voting. We show that it can be better for the players to vote randomly than to vote according to their own benefit in one turn. The former yields a winning tendency while the latter results in steady losses. An explanation of this behaviour is given by noting that selfish voting prevents the switching between games that is essential for the total capital to grow. Results for both finite and infinite number of players are presented. It is shown that the extension of the model to the history-dependent Parrondo’s paradox also displays the same effect.
منابع مشابه
Analytical Expressions for Parrondo Games
We present some new analytical expressions for the so-called Parrondo effect, where simple coin-flipping games with negative expected value are combined into a winning game. Parrondo games are state-dependent. By identifying the game state variable, we can compute the stationary game state probabilities. Mixing losing games increases the probability of entering into a game state with positive v...
متن کاملParrondo Games as Lattice Gas Automata
Parrondo games are coin flipping games with the surprising property that alternating plays of two losing games can produce a winning game. We show that this phenomenon can be modelled by probabilistic lattice gas automata. Furthermore, motivated by the recent introduction of quantum coin flipping games, we show that quantum lattice gas automata provide an interesting definition for quantum Parr...
متن کاملParrondo games with spatial dependence, III
We study Toral’s Parrondo games with N players and one-dimensional spatial dependence as modified by Xie et al. Specifically, we use computer graphics to sketch the Parrondo and anti-Parrondo regions for 3 ≤ N ≤ 9. Our work was motivated by a recent paper of Li et al., who applied a state space reduction method to this model, reducing the number of states from 2 to N + 1. We show that their red...
متن کاملNoisy quantum Parrondo games
Alternating two fair coin flipping games can create a winning game. Such a Parrondo game is a discrete model for a thermal ratchet. Recently we have constructed quantum versions of these coin flipping games that display the same “paradoxical” behavior. In this paper we add noise to these quantum Parrondo games in order that they can be compared with continuum models of quantum ratchets. Simulat...
متن کاملParrondo Games and Quantum Algorithms
We pursue the possible connections between classical games and quantum computation. The Parrondo game is one in which a random combination of two losing games produces a winning game. We introduce novel realizations of this Parrondo effect in which the player can ‘win’ via random reflections and rotations of the state-vector, and connect these to known quantum algorithms. [email protected]...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1410.0488 شماره
صفحات -
تاریخ انتشار 2003